Problems of projection

Modelling Decision Problems Via Birkhoff Polyhedra

A compact formulation of the set of tours neither in a graph nor its complement is presented and illustrates a general methodology proposed for constructing polyhedral models of decision problems based upon permutations, projection and lifting techniques. Directed Hamilton tours on n vertex graphs are interpreted as (n-1)- permutations. Sets of extrema of Birkhoff polyhedra are mapped to tours ...

Approximating fixed points for nonexpansive mappings and generalized mixed equilibrium problems in Banach spaces

We introduce a new iterative scheme for nding a common elementof the solutions set of a generalized mixed equilibrium problem and the xedpoints set of an innitely countable family of nonexpansive mappings in a Banachspace setting. Strong convergence theorems of the proposed iterative scheme arealso established by the generalized projection method. Our results generalize thecorresponding results...

Iterative Methods for Equilibrium Problems, Variational Inequalities and Fixed Points

Variational inequalities on Hilbert $C^*$-modules

We introduce variational inequality problems on Hilbert $C^*$-modules and we prove several existence results for variational inequalities defined on closed convex sets. Then relation between variational inequalities, $C^*$-valued metric projection and fixed point theory  on  Hilbert $C^*$-modules is studied.

The Effectiveness of Modified Vertical Dome Division Technique in Reducing Nasal Tip Projection in Rhinoplasty

Background: The technique of vertical dome division or tip defining, involves incising the lateral crura and vestibular skin at or lateral to the dome or tip defining point. The incision di-vides the lower lateral cartilage into a lateral segment and a medial segment, which are advanced anteriorly and sutured together to increase tip projection. The present study aimed at assessing a new vertic...

On Sequential Optimality Conditions without Constraint Qualifications for Nonlinear Programming with Nonsmooth Convex Objective Functions

Sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. Here, nonsmooth approximate gradient projection and complementary approximate Karush-Kuhn-Tucker conditions are presented. These sequential optimality conditions are satisfied by local minimizers of optimization problems independently of the fulfillment of constrai...